Globally rigid graphs are fully reconstructible
نویسندگان
چکیده
Abstract A d -dimensional framework is a pair $(G,p)$ , where $G=(V,E)$ graph and p map from V to $\mathbb {R}^d$ . The length of an edge $uv\in E$ in the distance between $p(u)$ $p(v)$ said be globally rigid if G its lengths uniquely determine up congruence. called every generic rigid. In this paper, we consider problem reconstructing set arising framework. Roughly speaking, strongly reconstructible {C}^d$ (unlabeled) any -space, along with number vertices both association edges lengths. It known that on at least $d+2$ vertices, then it We strengthen result show that, under same conditions, fact fully which means alone sufficient reconstruct without constraint (although still assumption come realization). As key step our proof, also prove rigidity matroid connected. Finally, provide new families graphs use them answer some questions regarding unlabeled reconstructibility posed recent papers.
منابع مشابه
Small graphs are reconstructible
With the help of a novel computational technique, we show that graphs with up to 11 vertices are determined uniquely by their sets of vertex-deleted subgraphs, even if the set of subgraphs is reduced by isomorphism type. The same result holds for triangle-free graphs to 14 vertices, square-free graphs to 15 vertices and bipartite graphs to 15 vertices, as well as some other classes.
متن کاملChordal Graphs are Fully Orientable
Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let dmin(G) (dmax(G)) denote the minimum (maximum) of the number of dependent arcs over all acyclic orientations of G. We call G fully orientable if G has an acyclic orientation with exactly d dependent arcs for every d satisfying dmin(G) 6 d 6 dmax(G). A graph G is c...
متن کاملCombining Globally Rigid Frameworks
Here it is shown how to combine two generically globally rigid bar frameworks in d-space to get another generically globally rigid framework. The construction is to identify d+1 vertices from each of the frameworks and erase one of the edges that they have in common.
متن کاملGlobally consistent rigid registration
In this paper we present a novel approach to register multiple scans from a static object. We formulate the registration problem as an optimization of the maps from all other scans to one reference scan where any map between two scans can be represented by the composition of these maps. In this way, all loop closures can be automatically guaranteed as the maps among all scans are globally consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum of Mathematics, Sigma
سال: 2022
ISSN: ['2050-5094']
DOI: https://doi.org/10.1017/fms.2022.44